Block-transitive designs in affine spaces

نویسنده

  • Michael Huber
چکیده

This paper deals with block-transitive t-(v, k, λ) designs in affine spaces for large t, with a focus on the important index λ = 1 case. We prove that there are no non-trivial 5-(v, k, 1) designs admitting a block-transitive group of automorphisms that is of affine type. Moreover, we show that the corresponding non-existence result holds for 4-(v, k, 1) designs, except possibly when the group is one-dimensional affine. Our approach involves a consideration of the finite 2-homogeneous affine permutation groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence of 2-(v, k, 1) Designs Admitting a Block-Transitive Group of Affine Type

In this paper we use Weil’s estimate on character sums to prove that large admissible prime powers q admit 2-(q, k, 1) designs having block-transitive automorphism groups in AGL(1, q).

متن کامل

3-Homogeneous Groups and Block-Transitive 7–(v, k, 3) Designs

The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block-transitive 7–(v, k, 3) design and prove our main theorem: If the automorphism group of a 7–(v, k, 3) design is block-transitive, then it is neithe...

متن کامل

Constructing a Class of Symmetric Graphs

We find a natural construction of a large class of symmetric graphs from pointand block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B,C of B, either there is no edge between B and C , or there exists only one vertex in B not adjacent to any verte...

متن کامل

On classifying finite edge colored graphs with two transitive automorphism groups

This paper classifies all finite edge colored graphs with doubly transitive automorphism groups. This result generalizes the classification of doubly transitive balanced incomplete block designs with 1 and doubly transitive one-factorizations of complete graphs. It also provides a classification of all doubly transitive symmetric association schemes. The classification of finite simple groups i...

متن کامل

Distorting symmetric designs

A simple replacement approach is used to construct new symmetric and affine designs from projective or affine spaces. This is used to construct symmetric designs with a given automorphism group, to study GMW-designs, and to construct new affine designs whose automorphism group fixes a point and has just two pointand block-orbits.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2010